Probabilistic Argumentation with Incomplete Information
نویسندگان
چکیده
We consider augmenting abstract argumentation frameworks with probabilistic information and discuss different constraints to obtain meaningful probabilistic information. Moreover, we investigate the problem of incomplete probability assignments and propose a solution for completing these assignments by applying the principle of maximum entropy.
منابع مشابه
Rational Argumentation under Uncertainty
Common sense arguments are practically always about incomplete and uncertain information. We distinguish two aspects or kinds of uncertainty. The one is defined as a persons’ uncertainty about the truth of a sentence. The other uncertainty is defined as a persons’ uncertainty of his assessment of the truth of a sentence. In everyday life argumentation we are often faced with both kinds of uncer...
متن کاملVerification in Incomplete Argumentation Frameworks
We tackle the problem of expressing incomplete knowledge in abstract argumentation frameworks originally introduced by Dung [15]. In applications, incomplete argumentation frameworks may arise as intermediate states in an elicitation process, or when merging different beliefs about an argumentation framework’s state, or in cases where complete information cannot be obtained. We consider two spe...
متن کاملArgumentation with Abduction
This paper presents a general approach to combining argumentation and abduction where the different uses of argumentation for preference reasoning and abduction for reasoning under incomplete information are synthesized together in an enhancing way. This integrated approach of argumentation and abduction can form the basis for encoding adaptable preference policies in the face of incomplete inf...
متن کاملA Semantics of Argumentation under Incomplete Information
We discuss a semantics of argumentation under incomplete information. In this paper, we mean by “incomplete information” that an agent does not know the other agent’s knowledge and therefore, the agent cannot predict which arguments are attacked and which counterarguments are used in order to attack the arguments. In this paper, we provide a more general framework for such argumentation system ...
متن کاملToward a Computational Analysis of Probabilistic Argumentation Frameworks
In this paper we analyze probabilistic argumentation frameworks (PAFs), defined as an extension of Dung abstract argumentation frameworks in which each argument is asserted with a probability . The debate around PAFs has so far centered on their theoretical definition and basic properties. This work contributes to their computational analysis by proposing a first recursive algorithm to compute ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014